Regular Behaviours with Names
نویسندگان
چکیده
منابع مشابه
Regular Behaviours with Names
Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and α-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model, e.g., various forms of automata with names as well as infinite terms with variable binding operators (such as λ-abstraction). Here, we first study the behaviour of or...
متن کاملAn Elimination Theorem for Regular Behaviours with Integration
This chapter deals with an extension of the process algebra ACP with rational time and integration. We determine a proper subdomain of the regular processes for which an elimination theorem holds, namely, for each pair of processes p0 ; p1 in this class there is a process q in this class such that p0kp1 and q are bisimilar. Some simple examples show that if this subdomain is enlarged, then the ...
متن کاملDeriving Syntax and Axioms for Quantitative Regular Behaviours
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are r...
متن کاملA Complete Inference System for a Class of Regular Behaviours
Let us think of such a tree (in which we take no account of the order among the sons of a node) as modelling the behaviour of a machine accepting symbols from, or submitting to observations by, its environment. In tree Tl only the symbol a may be accepted at the start (or, only the observation a may be made), after which b or c may be accepted. The tree is determinate, since no node has two out...
متن کاملOn the star height of unary regular behaviours
We prove that for each integer n there is a regular expression over a singleton alphabet which is not bisimilar to any regular expression of star height less than n, thus positively answering a long-standing question of Robin Milner.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Categorical Structures
سال: 2016
ISSN: 0927-2852,1572-9095
DOI: 10.1007/s10485-016-9457-8